Anti-measurement Matrix Uncertainty Sparse Signal Recovery for Compressive Sensing

نویسندگان

  • Yipeng Liu
  • Qun Wan
  • Fei Wen
  • Jia Xu
  • Yingning Peng
چکیده

Compressive sensing (CS) is a technique for estimating a sparse signal from the random measurements and the measurement matrix. Traditional sparse signal recovery methods have seriously degeneration with the measurement matrix uncertainty (MMU). Here the MMU is modeled as a bounded additive error. An anti-uncertainty constraint in the form of a mixed 2  and 1  norm is deduced from the sparse signal model with MMU. Then we combine the sparse constraint with the anti-uncertainty constraint to get an anti-uncertainty sparse signal recovery operator. Numerical simulations demonstrate that the proposed operator has a better reconstructing performance with the MMU than traditional methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical Recovery in Compressive Sensing

A combinatorial approach to compressive sensing based on a deterministic column replacement technique is proposed. Informally, it takes as input a pattern matrix and ingredient measurement matrices, and results in a larger measurement matrix by replacing elements of the pattern matrix with columns from the ingredient matrices. This hierarchical technique yields great flexibility in sparse signa...

متن کامل

A Simple Homotopy Proximal Mapping for Compressive Sensing

In this paper, we present a novel yet simple homotopy proximal mapping algorithm for compressive sensing. The algorithm adopts a simple proximal mapping of the l1 norm at each iteration and gradually reduces the regularization parameter for the l1 norm. We prove a global linear convergence of the proposed homotopy proximal mapping (HPM) algorithm for solving compressive sensing under three diff...

متن کامل

A Simple Homotopy Proximal Mapping Algorithm for Compressive Sensing

In this paper, we present a novel yet simple homotopy proximal mapping algorithm for compressive sensing. The algorithm adopts a simple proximal mapping for l1 norm regularization at each iteration and gradually reduces the regularization parameter of the l1 norm. We prove a global linear convergence for the proposed homotopy proximal mapping (HPM) algorithm for solving compressive sensing unde...

متن کامل

Sparse Signal Recovery from Fixed Low-Rank Subspace via Compressive Measurement

This paper designs and evaluates a variant of CoSaMP algorithm, for recovering the sparse signal s from the compressive measurement ( ) v Uw s   given a fixed lowrank subspace spanned by U. Instead of firstly recovering the full vector then separating the sparse part from the structured dense part, the proposed algorithm directly works on the compressive measurement to do the separation. We i...

متن کامل

Nearly Linear-Time Model-Based Compressive Sensing

Compressive sensing is a method for recording a k-sparse signal x ∈ R with (possibly noisy) linear measurements of the form y = Ax, where A ∈ Rm×n describes the measurement process. Seminal results in compressive sensing show that it is possible to recover the signal x from m = O(k log n k ) measurements and that this is tight. The model-based compressive sensing framework overcomes this lower ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010